Exploring Texture Ensembles by Efficient Markov Chain Monte CarloÐToward a aTrichromacyo Theory of Texture
نویسندگان
چکیده
ÐThis article presents a mathematical definition of textureÐthe Julesz ensemble h, which is the set of all images (defined on Z) that share identical statistics h. Then texture modeling is posed as an inverse problem: Given a set of images sampled from an unknown Julesz ensemble h , we search for the statistics h which define the ensemble. A Julesz ensemble h has an associated probability distribution q I; h, which is uniform over the images in the ensemble and has zero probability outside. In a companion paper [33], q I; h is shown to be the limit distribution of the FRAME (Filter, Random Field, And Minimax Entropy) model [36], as the image lattice ! Z. This conclusion establishes the intrinsic link between the scientific definition of texture on Z and the mathematical models of texture on finite lattices. It brings two advantages to computer vision: 1) The engineering practice of synthesizing texture images by matching statistics has been put on a mathematical foundation. 2) We are released from the burden of learning the expensive FRAME model in feature pursuit, model selection and texture synthesis. In this paper, an efficient Markov chain Monte Carlo algorithm is proposed for sampling Julesz ensembles. The algorithm generates random texture images by moving along the directions of filter coefficients and, thus, extends the traditional single site Gibbs sampler. We also compare four popular statistical measures in the literature, namely, moments, rectified functions, marginal histograms, and joint histograms of linear filter responses in terms of their descriptive abilities. Our experiments suggest that a small number of bins in marginal histograms are sufficient for capturing a variety of texture patterns. We illustrate our theory and algorithm by successfully synthesizing a number of natural textures. Index TermsÐGibbs ensemble, Julesz ensemble, texture modeling, texture synthesis, Markov chain Monte Carlo.
منابع مشابه
Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo-Toward a 'Trichromacy' Theory of Texture
ÐThis article presents a mathematical definition of textureÐthe Julesz ensemble h, which is the set of all images (defined on Z) that share identical statistics h. Then texture modeling is posed as an inverse problem: Given a set of images sampled from an unknown Julesz ensemble h , we search for the statistics h which define the ensemble. A Julesz ensemble h has an associated probability...
متن کاملExploring Texture Ensembles by EÆcient Markov Chain Monte Carlo
This article presents a mathematical de nition of texture { the Julesz ensemble (h), which is the set of all images (de ned on Z) that share identical statistics h. Then texture modeling is posed as an inverse problem: given a set of images sampled from an unknown Julesz ensemble (h ), we search for the statistics h which de ne the ensemble. A Julesz ensemble (h) has an associated probability d...
متن کاملMRMRF Texture Classi cation and MCMC Parameter Estimation
Texture classiication is an important area in the eld of texture analysis. In this paper, we propose a novel stochastic approach{multiresolution Markov Random Field (MRMRF) model to represent textures and a parameter estimation method based on Markov chain Monte Carlo method is proposed. The parameters estimated from the decomposed sub-bands can be used as features to classify textures. The cla...
متن کاملTexture Replacement in Real Images
Texture replacement in real images has many applications, such as interior design, digital movie making and computer graphics. The goal is to replace some specified texture patterns in an image while preserving lighting effects, shadows and occlusions. To achieve convincing replacement results we have to detect texture patterns and estimate lighting map from a given image. Near regular planar t...
متن کاملApproximate Bayes Model Selection Procedures for Markov Random Fields
For applications in texture synthesis, we derive two approximate Bayes criteria for selecting a model from a collection of Markov random fields. The first criterion is based on a penalized maximum likelihood. The second criterion, a Markov chain Monte Carlo approximation to the first, has distinct computational advantages. Some simulation results are also presented.
متن کامل